A first-order epistemic quantum computational semantics with relativistic-like epistemic effects

نویسندگان

  • Maria Luisa Dalla Chiara
  • Roberto Giuntini
  • Roberto Leporini
  • Giuseppe Sergioli
چکیده

Quantum computation has suggested new forms of quantum logic, called quantum computational logics. In these logics wellformed formulas are supposed to denote pieces of quantum information: possible pure states of quantum systems that can store the information in question. At the same time, the logical connectives are interpreted as quantum logical gates: unitary operators that process quantum information in a reversible way, giving rise to quantum circuits. Quantum computational logics have been mainly studied as sentential logics (whose alphabet consists of atomic sentences and of logical connectives). In this article we propose a semantic characterization for a first-order epistemic quantum computational logic, whose language can express sentences like “Alice knows that everybody knows that she is pretty”. One can prove that (unlike the case of logical connectives) both quantifiers and epistemic operators cannot be generally represented as (reversible) quantum logical gates. The “act of knowing” and the use of universal (or existential) assertions seem to involve some irreversible “theoretic jumps”, which are similar to quantum measurements. Since all epistemic agents are characterized by specific epistemic domains (which contain all pieces of information accessible to them), the unrealistic phenomenon of logical omniscience is here avoided: knowing a given sentence does not imply knowing all its logical consequences.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum approach to epistemic semantics

Quantum information has suggested new forms of quantum logic, called quantum computational logics, where meanings of sentences are represented by pieces of quantum information (generally, density operators of some Hilbert spaces), which can be stored and transmitted by means of quantum particles. This approach can be applied to a semantic characterization of epistemic logical operations, which ...

متن کامل

A Quantum Computational Semantics for Epistemic Logical Operators. Part I: Epistemic Structures

Some critical open problems of epistemic logics can be investigated in the framework of a quantum computational approach. The basic idea is to interpret sentences like “Alice knows that Bob does not understand that π is irrational” as pieces of quantum information (generally represented by density operators of convenient Hilbert spaces). Logical epistemic operators (to understand, to know. . .)...

متن کامل

Robustness-based portfolio optimization under epistemic uncertainty

In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...

متن کامل

Epistemic Quantum Computational Structures in a Hilbert-space Environment

Quantum computation and quantum computational logics are intrinsically connected with some puzzling epistemic problems. In the framework of a quantum computational approach to epistemic logic we investigate the following question: is it possible to interpret the basic epistemic operations (having information, knowing) as special kinds of Hilbert-space operations? We show that non-trivial knowle...

متن کامل

Cognitivism about Epistemic Modality: Epistemic Modal Algebra, Homotopy Type Theory, and the Computational Theory of Mind

This paper aims to vindicate the thesis that cognitive computational properties are abstract objects implemented in physical systems. I avail of the equivalence relations countenanced in Homotopy Type Theory, in order to specify an abstraction principle for intensional, computational properties. The homotopic abstraction principle for intensional mental functions provides an epistemic conduit i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fuzzy Sets and Systems

دوره 298  شماره 

صفحات  -

تاریخ انتشار 2016